GPU Acceleration of Near-Minimal Logic Minimization
نویسندگان
چکیده
In this paper, we describe a GPU-accelerated implementation of a logic minimization heuristic based on the near minimal approach. This algorithm has three key kernel computations, and the current version of our implementation, we adapted one of these kernels for GPU execution. In this paper we report our results gained from using NVIDIA’s CUDA development framework and an NVIDIA Tesla GPUs, achieving a nearly 10X speedup as compared to a software implementation executed on a Xeon 5500-series processor.
منابع مشابه
Computing Privacy-Preserving Edit Distance and Smith-Waterman Problems on the GPU Architecture
This paper presents privacy-preserving, parallel computing algorithms on a graphic processing unit (GPU) architecture to solve the Edit-Distance (ED) and the Smith-Waterman (SW) problems. The ED and SW problems are formulated into dynamic programming (DP) computing problems, which are solved using the Secure Function Evaluation (SFE) to meet privacy protection requirements, based on the semi-ho...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES An exact algorithm for energy efficient acceleration of task trees on CPU/GPU architectures
We consider the problem of energy-efficient acceleration of applications comprising multiple interdependent tasks forming a dependency tree, on a hypothetical CPU/GPU system where both a CPU and a GPU can be powered off when idle. Each task in the tree can be invoked on both a GPU or a CPU, but the performance may vary: some run faster on a GPU, others prefer a CPU, making the choice of the low...
متن کاملAcceleration of Turbomachinery Steady Simulations on GPU
Steady state simulations in Computational Fluid Dynamics (CFD), which rely on implicit time integration, are not experiencing great accelerations on GPUs. Moreover, most of the reported acceleration effort concerns solving the linear system of equations while neglecting the acceleration potential of running the entire simulation on the GPU. In this paper, we present the software implementation ...
متن کاملAn algorithm for multiple output minimization
Absfracf-A computer-aided design procedure for the minimization of multiple output Boolean functions as encountered in the synthesis of VLSI logic circuits i s presented in this paper. A fast technique for the determination of essential prime cubes without generating all the prime cubes i s among the salient features of the algorithm. The paper also describes a new class of selective prime cube...
متن کاملMinimal Model Generation Based on E-hyper Tableaux
Minimal model generation has received great attention as people have deeper and deeper understanding in the semantics of the logic programming, deductive database, non monotonic reasoning and the relationships among them. But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal mode...
متن کامل